Wm Groups and Ramsey Theory
نویسندگان
چکیده
Our goal in this paper is to exhibit a connection between two seemingly disparate areas: Ramsey theory and the theory of unitary representations of a class of locally compact groups. The class of groups that we are interested in consists of the so-called ”minimally periodic groups” introduced by von Neumann in [N]; namely, groups having the property that they do not admit non-trivial almost periodic functions. This, in turn, is equivalent to the property of not having non-trivial finite dimensional unitary representations. One can show that yet another equivalent form of the above condition is that any ergodic measure preserving action of such a group on a finite measure space is actually weakly mixing. It is this aspect that will interest us and so we call these groups WM groups, and the class of these is denoted WM. As we shall see WM groups that are also amenable have unexpected Ramsey-theoretical properties. Here are some examples of WM groups: (i) SL(2,R), or more generally, any simple non-compact Lie group with finite center. (ii) The group Alt(N) of even permutations of N, or more generally, any group which is a direct limit of compact simple groups. Note that the examples in (i) are non-amenable and those in (ii) are amenable. Amenability of a locally compact group can be defined in two ways. One of these is in terms of an invariant mean, that is, a functional on either bounded continuous functions or bounded Borel measurable functions having the same value on a function as on its translate: m(f) = m(fu), where fu(g) = f(ug). An alternative characterization is in terms of Følner sequences. A sequence of compact sets (Fn) in G is called (left) Følner sequence, if for any g ∈ G one has |Fn ∩ gFn| |Fn| → 1 as n→∞,
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملRamsey numbers of stars versus wheels of similar sizes
We study the Ramsey number R(Wm, Sn) for a star Sn on n vertices and a wheel Wm on m + 1 vertices. We show that the Ramsey number R(Wm, Sn)= 3n− 2 for n=m,m+ 1, and m+ 2, where m 7 and odd. In addition, we give the following lower bound for R(Wm, Sn) where m is even: R(Wm, Sn) 2n+ 1 for all n m 6. © 2004 Elsevier B.V. All rights reserved.
متن کاملOn Ramsey numbers for paths versus wheels
For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn,Wm), where Pn is a path on n vertices and Wm is the graph obtained from a cycle on m vertices by adding a new ver...
متن کاملThe Ramsey Numbers of Paths Versus Wheels: a Complete Solution
Let G1 and G2 be two given graphs. The Ramsey number R(G1, G2) is the least integer r such that for every graph G on r vertices, either G contains a G1 or G contains a G2. We denote by Pn the path on n vertices and Wm the wheel on m + 1 vertices. Chen et al. and Zhang determined the values of R(Pn,Wm) when m 6 n + 1 and when n + 2 6 m 6 2n, respectively. In this paper we determine all the value...
متن کاملA Cycle or Jahangir Ramsey Unsaturated Graphs
A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. We present some result concerning both Ramsey saturated and unsaturated graph. In particular, we show that a cycle Cn and a Jahangir Jm Ramsey unsaturated or saturated graphs of R(Cn,Wm) and R(Pn, Jm), respectively. We also suggest an open problems.
متن کامل